Minimal Total Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
نویسندگان
چکیده
منابع مشابه
Convexity of Minimal Dominating and Total Dominating Functions of Corona Product Graph of a Cycle with a Complete Graph
Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [1,2]. Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to an importa...
متن کاملSigned Dominating and Total Dominating Functions of Corona Product Graph of a Path with a Star
Domination in graphs has been an extensively researched branch of graph theory. Graph theory is one of the most flourishing branches of modern mathematics and computer applications. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [ 1, 2]. Recently dominating functions in domination theory have receiv...
متن کاملConvexity of Minimal Dominating and Total Dominating Functions of Corona Product Graph of a Path with a Star
‘Domination in graphs’ has been studied extensively and at present it is an emerging area of research in graph theory. An introduction and an extensive overview on domination in graphs and related topics is surveyed and detailed in the two books by Haynes et al. [1,2]. Product of graphs occurs naturally in discrete mathematics as tools in combinatorial constructions. They give rise to an import...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولthe common minimal dominating signed graph
in this paper, we define the common minimal dominating signed graph of a given signed graph and offer a structural characterization of common minimal dominating signed graphs. in the sequel, we also obtained switching equivalence characterizations: $overline{s} sim cmd(s)$ and $cmd(s) sim n(s)$, where $overline{s}$, $cmd(s)$ and $n(s)$ are complementary signed gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2014
ISSN: 2249-0868
DOI: 10.5120/ijais14-451090